Querying Streaming XML Using Visibly Pushdown Automata
نویسنده
چکیده
We present a novel solution to streaming XPath query evaluation, capable of supporting forward and reverse axes queries. We show a conversion of an XPath query to a Visibly Pushdown Automaton that preserves the semantics of the query. It was shown in [1] that such a construction results in an automation suitable for efficient streaming query evaluation. We also show that the constructed automaton is polynomial in size of the query when negated predicates are disallowed.
منابع مشابه
Streaming tree automata
Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the two main approaches, which have not been linked so far: automata for nested words or equivalently visibly pushdown automata, and respectively pushdown forest automata.
متن کاملVisibly Pushdown Transducers for Approximate Validation of Streaming XML
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent to Extended Document Type Definitions (EDTDs), and thus, they provide means for elegantly solving various problems on XML. Especially, it has been shown that VPAs are the apt device for streaming XML. One of the impor...
متن کاملUpdates, Schema Updates and Validation of XML Documents - Using Abstract State Machines with Automata-Defined States
The exact validation of streaming XML documents can be realised by using visibly push-down automata (VPA) that are defined by Extended Document Type Definitions (EDTD). It is straightforward to represent such an automaton as an Abstract State Machine (ASM). In doing so we enable computations on abstract states that are defined by a certain class of automata, in this case VPAs. In this paper we ...
متن کاملSymbolic Visibly Pushdown Automata
Nested words model data with both linear and hierarchical structure such as XML documents and program traces. A nested word is a sequence of positions together with a matching relation that connects open tags (calls) with the corresponding close tags (returns). Visibly Pushdown Automata are a restricted class of pushdown automata that process nested words, and have many appealing theoretical pr...
متن کاملEvolving Schemas for Streaming XML
In this paper we model schema evolution for XML by defining formal language operators on Visibly Pushdown Languages (VPLs). Our goal is to provide a framework for efficient validation of streaming XML in the realistic setting where the schemas of the exchanging parties evolve and thus diverge from one another. We show that Visibly Pushdown Languages are closed under the defined language operato...
متن کامل